Computationally Related Problems

Computationally Related Problems

Computationally Intractable Problems in Communications

The theory of NP-completeness deals with problems for which we do not know a deterministic algorithm for finding the solution in an amount of time polynomial in the size of the input. These problems—belonging to the set N P-complete—are of great practical importance because they arise naturally in numerous decision and optimization problems [Baas]. Yet, no one has shown whether such problems ca...

Locating phase transitions in computationally hard problems

We discuss how phase-transitions may be detected in computationally hard problems in the context of Anytime Algorithms. Treating the computational time, value and utility functions involved in the search results in analogy with quantities in statistical physics, we indicate how the onset of a computationally hard regime can be detected and the transit to higher quality solutions be quantified b...

Writing and Related Problems for EFL Students

ESL students who write in English may present written material in a rhetorical and organizational mode that reflects the pattern which is valued in their native culture and rhetoric. Considering the violation of English code of writing in the writings of Iranian students, we will notice one common characteristic: They are reluctant (or ignorant of) to write a unified paragraph. Their writing co...

International Health Problems Related to Alcohol Abuse

The harmful use of alcohol inflicts great deal of social and economic losses on individuals and societies. Given the increase in world population and the predicted increase in alcohol consumption, the alcohol related burden of disease progressively catches higher ranks in the list of factors threatening humans' life. It has been considered that the social and economic burden related to alcohol ...